
public class Node {
	private int value;
	private Node left;
	private Node right;
	public int getValue() {
		return value;
	}
	public Node getLeft() {
		return left;
	}
	public Node getRight() {
		return right;
	}
	public Node(int value, Node left, Node right) {
		super();
		this.value = value;
		this.left = left;
		this.right = right;
	}
	
	/**
	 * Checks if a certain value is in the tree.
	 * @param value - the value to search for
	 * @return - whether that value is in the tree.
	 */
	public boolean exists(int value){
		//TODO: Fill in this
		return false;
	}
	
	/**
	 * inserts a value into the tree. must maintain binary treeness
	 * @param newVal - new value to insert.
	 */
	public void insert(int newVal){
		//TODO: Fill in this
	}
}
